1566A Median Maximization codeforces solution in cpp
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int t,n,s,r,i;
cin>>t;
while(t--)
{
cin>>n>>s;
r=s/((n/2)+1);
cout<<r<<endl;
}
return 0;
}
1566A Median Maximization codeforces solution in cpp
by ujjal roy
#include<bits/stdc++.h>
using namespace std;
main()
{
int t,n,s,r,i;
cin>>t;
while(t--)
{
cin>>n>>s;
r=s/((n/2)+1);
cout<<r<<endl;
}
return 0;
}
0 Comments